|
In numerical linear algebra, a Jacobi rotation is a rotation, ''Q''''k''ℓ, of a 2-dimensional linear subspace of an ''n-''dimensional inner product space, chosen to zero a symmetric pair of off-diagonal entries of an ''n''×''n'' real symmetric matrix, ''A'', when applied as a similarity transformation: : : It is the core operation in the Jacobi eigenvalue algorithm, which is numerically stable and well-suited to implementation on parallel processors . Only rows ''k'' and ℓ and columns ''k'' and ℓ of ''A'' will be affected, and that ''A''′ will remain symmetric. Also, an explicit matrix for ''Q''''k''ℓ is rarely computed; instead, auxiliary values are computed and ''A'' is updated in an efficient and numerically stable way. However, for reference, we may write the matrix as : That is, ''Q''''k''ℓ is an identity matrix except for four entries, two on the diagonal (''q''''kk'' and ''q''ℓℓ, both equal to ''c'') and two symmetrically placed off the diagonal (''q''''k''ℓ and ''q''ℓ''k'', equal to ''s'' and −''s'', respectively). Here ''c'' = cos ϑ and ''s'' = sin ϑ for some angle ϑ; but to apply the rotation, the angle itself is not required. Using Kronecker delta notation, the matrix entries can be written : Suppose ''h'' is an index other than ''k'' or ℓ (which must themselves be distinct). Then the similarity update produces, algebraically, : : : : : == Numerically stable computation == To determine the quantities needed for the update, we must solve the off-diagonal equation for zero . This implies that : so that ρ = tan(ϑ/2). Then the revised update equations are : : : : : As previously remarked, we need never explicitly compute the rotation angle ϑ. In fact, we can reproduce the symmetric update determined by ''Q''''k''ℓ by retaining only the three values ''k'', ℓ, and ''t'', with ''t'' set to zero for a null rotation. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Jacobi rotation」の詳細全文を読む スポンサード リンク
|